A universal context-free grammar
نویسندگان
چکیده
منابع مشابه
Context-Free Grammar — Part I
The articles [8], [5], [9], [1], [10], [11], [3], [2], [7], [4], and [6] provide the notation and terminology for this paper. We consider tree construction structures as extensions of 1-sorted structure as systems 〈 a carrier, rules 〉, where the carrier is a set and the rules constitute a relation between the carrier and the carrier∗. Let us note that there exists a tree construction structure ...
متن کاملEfficient Context-Free Grammar Constraints
With the introduction of constraints based on finite automata a new line of research has opened where constraints are based on formal languages. Recently, constraints based on grammars higher up in the Chomsky hierarchy were introduced. We devise a timeand space-efficient incremental arc-consistency algorithm for context-free grammars. Particularly, we show how to filter a sequence of monotonic...
متن کاملAn augmented context free grammar
This paper presents an augmented context free grammar which describes important features of the surface structure and the semantics of discourse in a formal way, integrating new as well as previously existing insights into a unified framework. The structures covered include lists, narratives, subordinating and coordinating rhetorical relations, topic chains and interruptions. The paper discusse...
متن کاملA Context-Free Grammar Of French
Summarx. I present here a method that allows one to construct a CF grammar of a natural language that correctly accounts for verbal selection rules. This goes contrary to the prevailing opinion, following Chomsky 5, that such a construction is impossible. My method consists essentially in separating the semantic function of a selection rule, namely, the exclusion of certain noun sub-classes, fr...
متن کاملCGM: A context-free grammar manipulator
We present an interactive graphical environment for the manipulation of context-free languages. The graphical environment allows the editing of a context-free grammar, the conversion to Chomsky normal form, word parsing and the (interactive) construction of parse trees. It is possible to store positive and negative datasets of words to be tested by a given grammar. The main goal of this system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1975
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(75)90216-8